An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic
نویسندگان
چکیده
Several analytical models of fully-adaptive routing have recently been proposed for wormhole-routed k-ary ncubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. This paper describes the first analytical model of fully-adaptive wormhole routing in k-ary n-cubes in the presence of hot spot traffic. Results from simulation show close agreement with those predicted by the model.
منابع مشابه
Disha: A Performance Model of a True Fully Adaptive Routing Algorithm in k-Ary n-Cubes
A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerab...
متن کاملA General Analytical Model of Adaptive Wormhole Routing in k-Ary n-Cube Interconnection Networks
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern. Although, hypercube is a special case of k-ary n-cubes topology, the modeling approach for hypercube is more accurate than kary n-cubes due to its simpler structure. This paper proposes a general analytical model to predict message latency i...
متن کاملAlleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
This paper identiies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel ow control schemes to deliver better network performance. However, most of these results are based on innnite message co...
متن کاملTotal-Exchange on Wormhole k-ary n-cubes with Adaptive Routing
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching. This algorithm is based on an important property of the wormhole...
متن کاملDeep versus Parallel Buffers in Wormhole Switched k-Ary n-Cubes
Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging the buffer space dedicated to a given physical channel into multiple parallel buffers that share the physical bandwidth in a demand driven time-multiplexed manner. There have been few attempts to study the optimal arrangement of virtual channels (i.e. given a fixed amount...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000